IFT-Watershed from Gray-Scale Marker

نویسندگان

  • Roberto de Alencar Lotufo
  • Alexandre X. Falcão
  • Francisco A. Zampirolli
چکیده

Abstract. The watershed transform and the morphological reconstruction are two of the most important operators for image segmentation in the framework of mathematical morphology. In many situations, the segmentation requires the classical watershed transform of a reconstructed image. In this paper, we introduce the IFT-watershed from gray scale marker a method to compute at same time, the reconstruction and the classical watershed transform of the reconstructed image, without explicit computation of any regional minima. The method is based on the Image Foresting Transform (IFT) a unified and efficient approach to reduce image processing problems to a minimum-cost path forest problem in a graph. As additional contributions, we demonstrate that (i) the cost map of the IFT-watershed from markers is identical to the output of the superior gray scale reconstruction; (ii) other reconstruction algorithms are not watersheds; and (iii) the proposed method achieves competitive advantages as compared to the current classical watershed approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Watershed by image foresting transform, tie- zone, and theoretical relationships with other watershed definitions

To better understand the numerous solutions related to watershed transform (WT), this paper shows the relationships between some discrete definitions of the WT: the watersheds based on image foresting transform (IFT), topographic distance (TD), local condition (LC), and minimum spanning forest (MSF). We demonstrate that the tie-zone (TZ) concept, that unifies the multiple solutions of a given W...

متن کامل

A partitioned algorithm for the image foresting transform

The Image Foresting Transform (IFT) is a powerful graph-based framework for the design and implementation of image processing operators. In this work we present the Partitioned IFT (PIFT), an algorithm that computes any IFT operator as a series of independent IFT-like computations. The PIFT makes parallelization of existing IFT operators easy, and allows the computation of IFTs in systems with ...

متن کامل

Interactive 3D Heart Chamber Partitioning with a New Marker-Controlled Watershed Algorithm

Watershed transform has been widely used in medical image segmentation. One fundamental problem with it is over-segmentation. There are mainly two approaches to deal with this problem: hierarchical segmentation and segmentation with markers. The markers, either automatically extractedor interactively generated, aremostlyused in thehomotopymodification of morphological gradients prior to the wat...

متن کامل

Watershed by image foresting transform, tie-zone, and theoretical relationships with other watershed de nitions

To better understand the numerous solutions related to watershed transform (WT), this paper shows the relationships between some discrete de nitions of the WT: the watersheds based on image foresting transform (IFT), topographic distance (TD), local condition (LC), and minimum spanning forest (MSF). We demonstrate that the tie-zone (TZ) concept, that uni es the multiple solutions of a given WT,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002